Check Character Systems Using Chevalley Groups

نویسندگان

  • Claudia Broecker
  • Ralph-Hardo Schulz
  • Gernot Stroth
چکیده

We show that the Sylow 2-subgroups of nearly all Chevalley groups in even characteristic allow the definition of a check-character-system which detects all single and the most important double errors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Identity with Constants in a Chevalley Group of Type F4 v. Nesterov and A. Stepanov

N. L. Gordeev proved that a generalized group identity holds in Chevalley groups with multiply laced root systems. It was also shown that a stronger identity is valid for the Chevalley groups of types Bl and Cl. In the present paper, it is proved that this strong identity is fulfilled in Chevalley groups of type F4 and fails to be true in Chevalley groups of type G2. The main result of the pape...

متن کامل

Monomial Irreducible sln-Modules

In this article, we introduce monomial irreducible representations of the special linear Lie algebra $sln$. We will show that this kind of representations have bases for which the action of the Chevalley generators of the Lie algebra on the basis elements can be given by a simple formula.

متن کامل

ar X iv : 1 20 2 . 02 10 v 1 [ m at h . N T ] 1 F eb 2 01 2 Fourier coefficients of automorphic forms , character variety orbits , and small representations

We consider the Fourier expansions of automorphic forms on general Lie groups, with a particular emphasis on exceptional groups. After describing some principles underlying known results on GL(n), Sp(4), and G2, we perform an analysis of the expansions on split real forms of E6 and E7 where simplifications take place for automorphic realizations of real representations which have small Gelfand-...

متن کامل

On check character systems over quasigroups and loops

In this article we study check character systems that is error detecting codes, which arise by appending a check digit an to every word a1a2...an−1 : a1a2...an−1 → a1a2...an−1an with the check formula (...((a1 · δa2) · δ 2a3)...) · δ n−2an−1) · δ n−1an = c, where Q(·) is a quasigroup or a loop, δ is a permutation of Q, c ∈ Q. We consider detection sets for such errors as transpositions (ab → ba...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Des. Codes Cryptography

دوره 10  شماره 

صفحات  -

تاریخ انتشار 1997